Programming and Data Structures - Queues

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Computer Science And Information Technology > > Programming and Data Structures > > Queues

1. Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

2. A________search begins the search with the element that is located in the middle of the array.

Answer
Comment
Array

Option : D
Explanation : Binary Search algorithm can do this because it firstly searches the middle element. If the required element is less than the middle one, then search the middle element in the less than a part. If the required element is greater than the middle one, then search in the greater part. So the answer is 'D'.

You must be logged in to post a comment.

You must be logged in to post a comment.

3. A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q).For a sequence of operations,the key chosen are in

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

4. Queues serve major role in

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

5. Which of the following data structure may give overflow error, even though the current number of elements in it is less than its size?

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Queues

Forgot your password?

I agree with the Terms.